The Parsing of Extended Context-free Grammars
نویسنده
چکیده
Extended context-free grammars are context-free grammars in which the right-hand sides of productions are allowed to be any regular language rather than being restricted to be any nite language. We develop a novel approach to top-down predictive parser construction for extended context-free grammars that is based on rewriting of partial syntax trees. This work is motivated by our development of ecfg, a Java toolkit for the manipulation of extended context-free grammars, and by our continuing investigation of XML.
منابع مشابه
Generalized LR Parsing for Grammars with Contexts
The Generalized LR parsing algorithm for context-free grammars is notable for having a decent worst-case running time (cubic in the length of the input string), as well as much better performance on “good” grammars. This paper extends the Generalized LR algorithm to the case of “grammars with left contexts” (M. Barash, A. Okhotin, “An extension of context-free grammars with one-sided context sp...
متن کاملA preliminary report on generalized LR parsing for Boolean grammars
The generalized LR parsing algorithm for context-free grammars, invented by Tomita in 1986, is extended for the case of Boolean grammars – a recently introduced generalization of context-free grammars with logical connectives added to the formalism of rules. A high-level description of the algorithm, an elaborate example of its operation and a suggested implementation are provided. The algorith...
متن کاملGeneralized Lr Parsing Algorithm for Boolean Grammars
The generalized LR parsing algorithm for context-free grammars is extended for the case of Boolean grammars, which are a generalization of the context-free grammars with logical connectives added to the formalism of rules. In addition to the standard LR operations, Shift and Reduce, the new algorithm uses a third operation called Invalidate, which reverses a previously made reduction. This oper...
متن کاملAn extension of recursive descent parsing for Boolean grammars
The well-known recursive descent parsing method for context-free grammars is extended for their generalization, Boolean grammars, which include explicit set-theoretic operations in the formalism of rules. Conjunction is implemented by scanning a part of the input multiple times, while the mechanism of exception handling is used to implement negation. A subclass of LL(k) Boolean grammars, for wh...
متن کاملAn Efficient Augmented-Context-Free Parsing Algorithm
An efficient parsing algorithm for augmented context-free grammars is introduced, and its application to on-line natural language interfaces discussed. The algorithm is a generalized LR parsing algorithm, which precomputes an LR shift-reduce parsing table (possibly with multiple entries) from a given augmented context-free grammar. Unlike the standard LR parsing algorithm, it can handle arbitra...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2002